A dynamic programming approach to efficient sampling from Boltzmann distributions
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach to efficient sampling from Boltzmann distributions
Several algorithms in optimization, computer science and statistical mechanics are closely related to the problem of sampling from a Boltzmann distribution parameterized by the so-called temperature over a finite set. These include (i) Simulated Annealing (SA) [6], (ii) calculating the permanent of a nonnegative matrix [1], (iii) estimating the volume of a convex body [7], and (iv) computing pa...
متن کاملEfficient sampling in approximate dynamic programming algorithms
Dynamic Programming (DP) is known to be a standard optimization tool for solving Stochastic Optimal Control (SOC) problems, either over a finite or an infinite horizon of stages. Under very general assumptions, commonly employed numerical algorithms are based on approximations of the cost-to-go functions, by means of suitable parametric models built from a set of sampling points in the d-dimens...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملAn Efficient Quadratic Programming Approach to Stabilizing Dynamic Locomotion
We describe a whole-body dynamic walking controller implemented as a compact, convex quadratic program. The controller minimizes an optimal control condition on a simple model of the walking system while respecting the dynamic, input, and contact constraints of the full robot dynamics. By exploiting sparsity and temporal structure in the optimization with an active-set algorithm, we surpass the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.07.009